package javacode.chapter07.recursion;

/**
 * 递归输出啥
 */
public class Recursion01 {
    public static void main(String[] args) {
        T t1 = new T();
        t1.test(4);
        /*
        输出：
        n=2
        n=3
        n=4
         */


        int res = t1.factorial(5);
        System.out.println("5的阶乘 res=" +res);

    }
}

class T {
    public void test(int n) {
        if (n > 2) {
            test(n - 1);
        }
        System.out.println("n=" + n);

    }
    //阶乘
    public int factorial(int n){
        System.out.println("n = " + n);
        if (n==1){
            return 1;
        }else{
            return factorial(n-1)*n;
        }
    }

}
